Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
نویسندگان
چکیده
منابع مشابه
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
The maximum mean weight cycle problem is well-known: given a digraph G with weights 9 c :E(G) → R, 3nd a directed circuit in G whose mean weight is maximum. Closely related is the minimum balance problem: Find a potential :V (G) → R such that the numbers 11 slack(e):= (w)− (v)− c((v; w)) (e= (v; w)∈E(G)) are optimally balanced: for any subset of vertices, the minimum slack on an entering edge s...
متن کاملThe Min Mean-Weight Cycle in a Random Network
The mean weight of a cycle in an edge-weighted graph is the sum of the cycle’s edge weights divided by the cycle’s length. We study the minimum mean-weight cycle on the complete graph on n vertices, with random i.i.d. edge weights drawn from an exponential distribution with mean 1. We show that the probability of the min meanweight being at most c/n tends to a limiting function of c which is an...
متن کاملCell cycle and apoptosis: A review
Cancer is characterized by abnormally excessive cell proliferation. Cell proliferation, the process by which a cell grows and divides to produce two daughter cells. Each of these daughter cells divides to produce two new cells, steps that are called cell cycle. Meanwhile, apoptosis is a highly regulated process of cell death, which is involved not only in the development of shape and morphogene...
متن کاملCycles in the cycle pre x digraph
Cycle pre x digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry large number of nodes for a given degree and diameter simple shortest path routing Hamiltonic ity optimal connectivity and others In this paper we show that the cycle pre x digraphs like the Kautz digraphs contain cycles of all lengths l with l between two and N the order of the digraph exce...
متن کاملCycles in the cycle prefix digraph
Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths l, with l between two and N , the order of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00339-0